翻訳と辞書 Words near each other ・ Proximity-1 Space Link Protocol ・ Proximo Spirits ・ Proximodistal trend ・ Proximodorsal process ・ Proximus ・ Proximus (disambiguation) ・ Proximus Group ・ Proximus mobility ・ Proximus Skynet ・ Proximus TV ・ Proxiphocentron ・ Proxis ・ Proxiuber ・ Proxiuber australis ・ Proxiuber hulmei ・ Proxmap sort ・ Proxmox Virtual Environment ・ Proxomitron ・ Proxorphan ・ Proxy ・ Proxy (climate) ・ Proxy (film) ・ Proxy (novel) ・ Proxy (song) ・ Proxy (statistics) ・ Proxy advisor ・ Proxy ARP ・ Proxy auto-config ・ Proxy bid ・ Proxy board Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Proxmap sort ： ウィキペディア英語版 Proxmap sort ProxmapSort, or Proxmap sort, is a sorting algorithm that works by partitioning an array of data items, or keys, into a number of "subarrays" (termed buckets, in similar sorts). The name is short for computing a "proximity map," which indicates for each key K the beginning of a subarray where K will reside in the final sorted order. Keys are placed into each subarray using insertion sort. If keys are "well distributed" among the subarrays, sorting occurs in linear time. The computational complexity estimates involve the number of subarrays and the proximity mapping function, the "map key," used. It is a form of bucket and radix sort. Once a ProxmapSort is complete, ProxmapSearch can be used to find keys in the sorted array in $O(1)$ time if the keys were well distributed during the sort. Both algorithms were invented in the late 1980s by Prof. Thomas A. Standish at the University of California, Irvine. ==Overview== 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Proxmap sort」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.